Prime Power Divisors of Multinomial Coefficients and Artin′s Conjecture
نویسندگان
چکیده
منابع مشابه
On Common Divisors of Multinomial Coefficients
Erdős and Szekeres showed in 1978 that for any four positive integers satisfying m1 + m2 = n1 +n2, the two binomial coefficients (m1 +m2)!/m1!m2! and (n1 +n2)!/n1!n2! have a common divisor > 1. The analogous statement for families of k k-nomial coefficients (k > 1) was conjectured in 1997 by David Wasserman. Erdős and Szekeres remark that if m1, m2, n1, n2 as above are all > 1, there is probabl...
متن کاملOn Prime Divisors of Binomial Coefficients
This paper, using computational and theoretical methods, deals with prime divisors of binomial coefficients: Geometric distribution and number of distinct prime divisors are studied. We give a numerical result on a conjecture by Erdôs on square divisors of binomial coefficients.
متن کاملPrime divisors of palindromes
Abstract In this paper, we study some divisibility properties of palindromic numbers in a fixed base g ≥ 2. In particular, if PL denotes the set of palindromes with precisely L digits, we show that for any sufficiently large value of L there exists a palindrome n ∈ PL with at least (log log n)1+o(1) distinct prime divisors, and there exists a palindrome n ∈ PL with a prime factor of size at lea...
متن کاملOn irregular prime power divisors of the Bernoulli numbers
Let Bn (n = 0, 1, 2, . . .) denote the usual n-th Bernoulli number. Let l be a positive even integer where l = 12 or l ≥ 16. It is well known that the numerator of the reduced quotient Bl/l is a product of powers of irregular primes. Let (p, l) be an irregular pair with p below 12 million. We show that for every r ≥ 1 the congruence Bmr/mr ≡ 0 (mod p ) has a unique solution for mr where l ≡ mr ...
متن کاملThe Prime Power Conjecture is True for
The Prime Power Conjecture (PPC) states that abelian planar difference sets of order n exist only for n a prime power. Evans and Mann [1] verified this for cyclic difference sets for n ≤ 1600. In this paper we use the Mann test to verify the PPC for n ≤ 2, 000, 000.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1994
ISSN: 0022-314X
DOI: 10.1006/jnth.1994.1019